0.09/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.09/0.11	% Command    : run_E %s %d THM
0.11/0.32	% Computer : n020.cluster.edu
0.11/0.32	% Model    : x86_64 x86_64
0.11/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory   : 8042.1875MB
0.11/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 960
0.11/0.32	% WCLimit    : 120
0.11/0.32	% DateTime   : Tue Aug  9 04:19:35 EDT 2022
0.11/0.32	% CPUTime    : 
0.16/0.44	Running higher-order on 8 cores theorem proving
0.16/0.44	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.16/0.44	# Version: 3.0pre003-ho
0.16/0.45	# Preprocessing class: HSMSSMSSMLMNHSN.
0.16/0.45	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.16/0.45	# Starting ho_unfolding_3 with 600s (5) cores
0.16/0.45	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.16/0.45	# Starting almost_fo_3_lam with 120s (1) cores
0.16/0.45	# Starting post_as_ho1 with 120s (1) cores
0.16/0.45	# almost_fo_3_lam with pid 6421 completed with status 0
0.16/0.45	# Result found by almost_fo_3_lam
0.16/0.45	# Preprocessing class: HSMSSMSSMLMNHSN.
0.16/0.45	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.16/0.45	# Starting ho_unfolding_3 with 600s (5) cores
0.16/0.45	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.16/0.45	# Starting almost_fo_3_lam with 120s (1) cores
0.16/0.45	# No SInE strategy applied
0.16/0.45	# Search class: HGHNF-FFSM00-SHSSMFNN
0.16/0.45	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.16/0.45	# Starting new_ho_10 with 65s (1) cores
0.16/0.45	# new_ho_10 with pid 6424 completed with status 0
0.16/0.45	# Result found by new_ho_10
0.16/0.45	# Preprocessing class: HSMSSMSSMLMNHSN.
0.16/0.45	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.16/0.45	# Starting ho_unfolding_3 with 600s (5) cores
0.16/0.45	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.16/0.45	# Starting almost_fo_3_lam with 120s (1) cores
0.16/0.45	# No SInE strategy applied
0.16/0.45	# Search class: HGHNF-FFSM00-SHSSMFNN
0.16/0.45	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.16/0.45	# Starting new_ho_10 with 65s (1) cores
0.16/0.45	# Preprocessing time       : 0.001 s
0.16/0.45	# Presaturation interreduction done
0.16/0.45	
0.16/0.45	# Proof found!
0.16/0.45	# SZS status Theorem
0.16/0.45	# SZS output start CNFRefutation
0.16/0.45	thf(decl_22, type, meq_ind: mu > mu > $i > $o).
0.16/0.45	thf(decl_23, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
0.16/0.45	thf(decl_24, type, mnot: ($i > $o) > $i > $o).
0.16/0.45	thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o).
0.16/0.45	thf(decl_26, type, mand: ($i > $o) > ($i > $o) > $i > $o).
0.16/0.45	thf(decl_27, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
0.16/0.45	thf(decl_28, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
0.16/0.45	thf(decl_29, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
0.16/0.45	thf(decl_30, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
0.16/0.45	thf(decl_31, type, mforall_ind: (mu > $i > $o) > $i > $o).
0.16/0.45	thf(decl_32, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
0.16/0.45	thf(decl_33, type, mexists_ind: (mu > $i > $o) > $i > $o).
0.16/0.45	thf(decl_34, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
0.16/0.45	thf(decl_35, type, mtrue: $i > $o).
0.16/0.45	thf(decl_36, type, mfalse: $i > $o).
0.16/0.45	thf(decl_37, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
0.16/0.45	thf(decl_38, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
0.16/0.45	thf(decl_39, type, mreflexive: ($i > $i > $o) > $o).
0.16/0.45	thf(decl_40, type, msymmetric: ($i > $i > $o) > $o).
0.16/0.45	thf(decl_41, type, mserial: ($i > $i > $o) > $o).
0.16/0.45	thf(decl_42, type, mtransitive: ($i > $i > $o) > $o).
0.16/0.45	thf(decl_43, type, meuclidean: ($i > $i > $o) > $o).
0.16/0.45	thf(decl_44, type, mpartially_functional: ($i > $i > $o) > $o).
0.16/0.45	thf(decl_45, type, mfunctional: ($i > $i > $o) > $o).
0.16/0.45	thf(decl_46, type, mweakly_dense: ($i > $i > $o) > $o).
0.16/0.45	thf(decl_47, type, mweakly_connected: ($i > $i > $o) > $o).
0.16/0.45	thf(decl_48, type, mweakly_directed: ($i > $i > $o) > $o).
0.16/0.45	thf(decl_49, type, mvalid: ($i > $o) > $o).
0.16/0.45	thf(decl_50, type, minvalid: ($i > $o) > $o).
0.16/0.45	thf(decl_51, type, msatisfiable: ($i > $o) > $o).
0.16/0.45	thf(decl_52, type, mcountersatisfiable: ($i > $o) > $o).
0.16/0.45	thf(decl_53, type, rel_k: $i > $i > $o).
0.16/0.45	thf(decl_54, type, mbox_k: ($i > $o) > $i > $o).
0.16/0.45	thf(decl_55, type, mdia_k: ($i > $o) > $i > $o).
0.16/0.45	thf(decl_56, type, p: $i > $o).
0.16/0.45	thf(decl_57, type, q: $i > $o).
0.16/0.45	thf(decl_58, type, r: $i > $o).
0.16/0.45	thf(decl_59, type, esk1_0: $i).
0.16/0.45	thf(decl_60, type, esk2_0: $i).
0.16/0.45	thf(decl_61, type, esk3_0: $i).
0.16/0.45	thf(mand, axiom, ((mand)=(^[X6:$i > $o, X7:$i > $o]:(mnot @ (mor @ (mnot @ X6) @ (mnot @ X7))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mand)).
0.16/0.45	thf(mnot, axiom, ((mnot)=(^[X6:$i > $o, X3:$i]:(~((X6 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mnot)).
0.16/0.45	thf(mor, axiom, ((mor)=(^[X6:$i > $o, X7:$i > $o, X3:$i]:(((X6 @ X3)|(X7 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mor)).
0.16/0.45	thf(mimplies, axiom, ((mimplies)=(^[X6:$i > $o, X7:$i > $o]:(mor @ (mnot @ X6) @ X7))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mimplies)).
0.16/0.45	thf(mdia_k, axiom, ((mdia_k)=(^[X6:$i > $o]:(mnot @ (mbox_k @ (mnot @ X6))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^1.ax', mdia_k)).
0.16/0.45	thf(mbox_k, axiom, ((mbox_k)=(^[X6:$i > $o, X3:$i]:(![X14:$i]:((~((rel_k @ X3 @ X14))|(X6 @ X14)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^1.ax', mbox_k)).
0.16/0.45	thf(mvalid, axiom, ((mvalid)=(^[X6:$i > $o]:(![X3:$i]:((X6 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mvalid)).
0.16/0.45	thf(prove, conjecture, (mvalid @ (mimplies @ (mor @ (mdia_k @ (mand @ p @ q)) @ (mdia_k @ (mand @ p @ r))) @ (mdia_k @ p))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove)).
0.16/0.45	thf(c_0_8, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(fof_simplification,[status(thm)],[mand])).
0.16/0.45	thf(c_0_9, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])).
0.16/0.45	thf(c_0_10, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])).
0.16/0.45	thf(c_0_11, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])).
0.16/0.45	thf(c_0_12, plain, ((mdia_k)=(^[Z0:$i > $o, Z1:$i]:(~((![X21:$i]:((~((rel_k @ Z1 @ X21))|(~((Z0 @ X21)))))))))), inference(fof_simplification,[status(thm)],[mdia_k])).
0.16/0.45	thf(c_0_13, plain, ((mbox_k)=(^[Z0:$i > $o, Z1:$i]:(![X14:$i]:((~((rel_k @ Z1 @ X14))|(Z0 @ X14)))))), inference(fof_simplification,[status(thm)],[mbox_k])).
0.16/0.45	thf(c_0_14, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8, c_0_9]), c_0_10])).
0.16/0.45	thf(c_0_15, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_11, c_0_9]), c_0_10])).
0.16/0.45	thf(c_0_16, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])).
0.16/0.45	thf(c_0_17, plain, ((mdia_k)=(^[Z0:$i > $o, Z1:$i]:(~((![X21:$i]:((~((rel_k @ Z1 @ X21))|(~((Z0 @ X21)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12, c_0_9]), c_0_13])).
0.16/0.45	thf(c_0_18, negated_conjecture, ~(![X25:$i]:((~((~(![X22:$i]:((~(rel_k @ X25 @ X22)|~(~((~(p @ X22)|~(q @ X22)))))))|~(![X23:$i]:((~(rel_k @ X25 @ X23)|~(~((~(p @ X23)|~(r @ X23)))))))))|~(![X24:$i]:((~(rel_k @ X25 @ X24)|~(p @ X24))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[prove]), c_0_10]), c_0_14]), c_0_15]), c_0_16]), c_0_17])])).
0.16/0.45	thf(c_0_19, negated_conjecture, ![X29:$i]:((((((rel_k @ esk1_0 @ esk3_0)|(rel_k @ esk1_0 @ esk2_0))&(((p @ esk3_0)|(rel_k @ esk1_0 @ esk2_0))&((r @ esk3_0)|(rel_k @ esk1_0 @ esk2_0))))&((((rel_k @ esk1_0 @ esk3_0)|(p @ esk2_0))&(((p @ esk3_0)|(p @ esk2_0))&((r @ esk3_0)|(p @ esk2_0))))&(((rel_k @ esk1_0 @ esk3_0)|(q @ esk2_0))&(((p @ esk3_0)|(q @ esk2_0))&((r @ esk3_0)|(q @ esk2_0))))))&(~(rel_k @ esk1_0 @ X29)|~(p @ X29)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])])).
0.16/0.45	thf(c_0_20, negated_conjecture, ![X3:$i]:((~((rel_k @ esk1_0 @ X3))|~((p @ X3)))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.16/0.45	thf(c_0_21, negated_conjecture, ((rel_k @ esk1_0 @ esk3_0)|(p @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_19])).
0.16/0.45	thf(c_0_22, negated_conjecture, ((p @ esk3_0)|(p @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_19])).
0.16/0.45	thf(c_0_23, negated_conjecture, ((rel_k @ esk1_0 @ esk3_0)|(rel_k @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_19])).
0.16/0.45	thf(c_0_24, negated_conjecture, (p @ esk2_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])).
0.16/0.45	thf(c_0_25, negated_conjecture, ((p @ esk3_0)|(rel_k @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_19])).
0.16/0.45	thf(c_0_26, negated_conjecture, (rel_k @ esk1_0 @ esk3_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_23]), c_0_24])])).
0.16/0.45	thf(c_0_27, negated_conjecture, (p @ esk3_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_25]), c_0_24])])).
0.16/0.45	thf(c_0_28, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_26]), c_0_27])]), ['proof']).
0.16/0.45	# SZS output end CNFRefutation
0.16/0.45	# Parsed axioms                        : 72
0.16/0.45	# Removed by relevancy pruning/SinE    : 0
0.16/0.45	# Initial clauses                      : 48
0.16/0.45	# Removed in clause preprocessing      : 38
0.16/0.45	# Initial clauses in saturation        : 10
0.16/0.45	# Processed clauses                    : 24
0.16/0.45	# ...of these trivial                  : 0
0.16/0.45	# ...subsumed                          : 0
0.16/0.45	# ...remaining for further processing  : 24
0.16/0.45	# Other redundant clauses eliminated   : 0
0.16/0.45	# Clauses deleted for lack of memory   : 0
0.16/0.45	# Backward-subsumed                    : 1
0.16/0.45	# Backward-rewritten                   : 8
0.16/0.45	# Generated clauses                    : 5
0.16/0.45	# ...of the previous two non-redundant : 4
0.16/0.45	# ...aggressively subsumed             : 0
0.16/0.45	# Contextual simplify-reflections      : 1
0.16/0.45	# Paramodulations                      : 5
0.16/0.45	# Factorizations                       : 0
0.16/0.45	# NegExts                              : 0
0.16/0.45	# Equation resolutions                 : 0
0.16/0.45	# Propositional unsat checks           : 0
0.16/0.45	#    Propositional check models        : 0
0.16/0.45	#    Propositional check unsatisfiable : 0
0.16/0.45	#    Propositional clauses             : 0
0.16/0.45	#    Propositional clauses after purity: 0
0.16/0.45	#    Propositional unsat core size     : 0
0.16/0.45	#    Propositional preprocessing time  : 0.000
0.16/0.45	#    Propositional encoding time       : 0.000
0.16/0.45	#    Propositional solver time         : 0.000
0.16/0.45	#    Success case prop preproc time    : 0.000
0.16/0.45	#    Success case prop encoding time   : 0.000
0.16/0.45	#    Success case prop solver time     : 0.000
0.16/0.45	# Current number of processed clauses  : 5
0.16/0.45	#    Positive orientable unit clauses  : 4
0.16/0.45	#    Positive unorientable unit clauses: 0
0.16/0.45	#    Negative unit clauses             : 0
0.16/0.45	#    Non-unit-clauses                  : 1
0.16/0.45	# Current number of unprocessed clauses: 0
0.16/0.45	# ...number of literals in the above   : 0
0.16/0.45	# Current number of archived formulas  : 0
0.16/0.45	# Current number of archived clauses   : 19
0.16/0.45	# Clause-clause subsumption calls (NU) : 5
0.16/0.45	# Rec. Clause-clause subsumption calls : 5
0.16/0.45	# Non-unit clause-clause subsumptions  : 1
0.16/0.45	# Unit Clause-clause subsumption calls : 3
0.16/0.45	# Rewrite failures with RHS unbound    : 0
0.16/0.45	# BW rewrite match attempts            : 4
0.16/0.45	# BW rewrite match successes           : 4
0.16/0.45	# Condensation attempts                : 24
0.16/0.45	# Condensation successes               : 0
0.16/0.45	# Termbank termtop insertions          : 2489
0.16/0.45	
0.16/0.45	# -------------------------------------------------
0.16/0.45	# User time                : 0.004 s
0.16/0.45	# System time              : 0.002 s
0.16/0.45	# Total time               : 0.006 s
0.16/0.45	# Maximum resident set size: 1924 pages
0.16/0.45	
0.16/0.45	# -------------------------------------------------
0.16/0.45	# User time                : 0.006 s
0.16/0.45	# System time              : 0.003 s
0.16/0.45	# Total time               : 0.009 s
0.16/0.45	# Maximum resident set size: 1800 pages
0.16/0.45	EOF
